Unique paths as formal points
نویسندگان
چکیده
A point-free formulation of the König Lemma for trees with uniformly at most one infinite path allows for a constructive proof without unique choice. 2000 Mathematics Subject Classification: 03E25, 03F65 (primary); 05C05, 05C38, 05C63 (secondary)
منابع مشابه
Reachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملPATH BASED EQUIVALENCE CHECKING OF PETRI NET REPRESENTATION OF PROGRAMS FOR TRANSLATION VALIDATION Soumyadip Bandyopadhyay PATH BASED EQUIVALENCE CHECKING OF PETRI NET REPRESENTATION OF PROGRAMS FOR TRANSLATION VALIDATION
A user written application program goes through significant optimizing and parallelizing transformations, both (compiler) automated and human guided, before being mapped to an architecture. Formal verification of these transformations is crucial to ensure that they preserve the original behavioural specification. The PRES+ model (Petri net based Representation of Embedded Systems) encompassing ...
متن کاملGeometric Properties of 2-dimensional Brownian Paths
Let A be the set of all points of the plane C, visited by 2-dimensional Brownian motion before time 1. With probability 1, all points of A are “twist points” except a set of harmonic measure zero. “Twist points” may be continuously approached in C \ A only along a special spiral. Although negligible in the sense of harmonic measure, various classes of “cone points” are dense in A, with probabil...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملExcursion Laws and Exceptional Points on Brownian Paths
The purpose of this note is to present an example of a family of “exceptional points” on Brownian paths which cannot be constructed using an entrance law. Watanabe (1984, 1987) proved that various families of exceptional points on Brownian paths may be constructed using entrance laws. Special cases include excursions of onedimensional Brownian motion within square root boundaries (see Watanabe ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Logic & Analysis
دوره 3 شماره
صفحات -
تاریخ انتشار 2011